package 力扣日常刷题.木22一月.第13天0121;

/**
 * @author 帅小伙
 * @date 2022/1/21
 * @description
 */
public class Demo45动态规划排列的数目 {



    public int combinationSum4(int[] nums, int target) {
        int[] dp = new int[target+1];
        dp[0] = 1;
        for (int i = 1; i <= target ; i++) {
            for (int num : nums) {
                if(num <= i){
                    dp[i] += dp[i -num];
                }
            }
        }
        return dp[target];
    }

}
